Intersection numbers of bipartite distance-regular graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A characterization of bipartite distance-regular graphs

Article history: Received 9 April 2013 Accepted 15 December 2013 Available online 13 January 2014 Submitted by R. Brualdi

متن کامل

Codes in Bipartite Distance^regular Graphs

For each bipartition_of a bipartite distance-regular graph F, there naturally corresponds another distance-regular graph F called a halved graph. It is shown that the existence of a perfect e-code in a halved graph F is equivalent to the existence of a uniformly packed 2e-code in F with certain specific parameters. Using this equivalence, we show the non-existence of perfect codes for two class...

متن کامل

On bipartite Q-polynomial distance-regular graphs

Let Γ denote a bipartite Q-polynomial distance-regular graph with vertex set X, diameter d ≥ 3 and valency k ≥ 3. Let RX denote the vector space over R consisting of column vectors with entries in R and rows indexed by X. For z ∈ X, let ẑ denote the vector in RX with a 1 in the z-coordinate, and 0 in all other coordinates. Fix x, y ∈ X such that ∂(x, y) = 2, where ∂ denotes path-length distance...

متن کامل

Bipartite Distance-regular Graphs, Part II

This is a continuation of ``Bipartite Distance-regular Graphs, Part I''. We continue our study of the Terwilliger algebra T of a bipartite distance-regular graph. In this part we focus on the thin irreducible T-modules of endpoint 2 and on those distance-regular graphs for which every irreducible T-module of endpoint 2 is thin. 8. Introduction to Part II Let G ˆ …X ;E† denote a bipartite distan...

متن کامل

Leaves in Representation Diagrams of Bipartite Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D ≥ 3 and valency k ≥ 3. Let θ0 > θ1 > · · · > θD denote the eigenvalues of and let qh i j (0 ≤ h, i, j ≤ D) denote the Krein parameters of . Pick an integer h (1 ≤ h ≤ D − 1). The representation diagram = h is an undirected graph with vertices 0, 1, . . . , D. For 0 ≤ i, j ≤ D, vertices i, j are adjacent in whenever i = j and qh i j =...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1997

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(96)00023-4